ALGORITHMS AND IDENTITIES FOR BIVARIATE $(h_1, h_2)$-BLOSSOMING
نویسندگان
چکیده
منابع مشابه
Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs
We continue a recent systematic study into the clique-width of (H1, H2)-free graphs and present five new classes of (H1, H2)-free graphs of bounded clique-width. As a consequence, we have reduced the number of open cases from 13 to 8. Four of the five new graph classes have in common that one of their two forbidden induced subgraphs is the triangle. As such, we generalize corresponding results ...
متن کاملAlgorithms for bivariate zonoid depth
Zonoid depth is a new notion of data depth proposed by Dy-ckerhoff et al [DKM96]. We give efficient algorithms for solving several zonoid depth problems for 2-dimensional (bi-variate) data. Data depth measures how deep or central a given point 0 in 1 3 2 is relative to a given data cloud or a probability distribution in 1 4 2. Some examples of data depth are halfspace, simplicial, convex hull p...
متن کاملAlgorithms for Bivariate Majority Depth
The majority depth of a point with respect to a point set is the number of major sides it is in. An algorithm for majority depth in R is given in this paper, and it is the first algorithm to compute the majority depth. This algorithm runs in O((n+m) log n) time with Brodal and Jacob’s data structure, and in O ( (n + m) log n log log n ) time in the word RAM model.
متن کاملOn colouring (2P2, H)-free and (P5, H)-free graphs
The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no induced subgraph isomorphic to $H_1$ or $H_2$. A connected graph $H_1$ is almost classified if Colouring on $(H_1,H_2)$-free graphs is known to be polynomial-time ...
متن کاملGeneralized Bivariate Fibonacci-Like Polynomials and Some Identities
In [3], H. Belbachir and F. Bencherif generalize to bivariate polynomials of Fibonacci and Lucas, properties obtained for Chebyshev polynomials. They prove that the coordinates of the bivariate polynomials over appropriate basis are families of integers satisfying remarkable recurrence relations. [7], Mario Catalani define generalized bivariate polynomials, from which specifying initial conditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Apllied Mathematics
سال: 2017
ISSN: 1311-1728,1314-8060
DOI: 10.12732/ijam.v30i4.5